On joint triangulations of two sets of points in the plane

نویسندگان

  • Ajit A. Diwan
  • Subir Kumar Ghosh
  • Partha P. Goswami
  • Andrzej Lingas
چکیده

In this paper, we establish two necessary conditions for a joint triangulation of two sets of n points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in O(n) time. For the problem of a joint triangulation of two simple polygons of n vertices, we propose an O(n) time algorithm for constructing a joint triangulation using dynamic programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Lower Bound on the Number of Triangulations

Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...

متن کامل

An Improved Lower Bound on the Minimum Number of Triangulations

Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...

متن کامل

مدل‌سازی صفحه‌ای محیط‌های داخلی با استفاده از تصاویر RGB-D

In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...

متن کامل

The Number of Triangulations on Planar Point Sets

We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n× n integer lattice. Given a finite point set P in the plane, a geometric graph is a straight line embedded graph with vertex set P where no segment realizing an edge contains points from P other than its endpoints. We are inter...

متن کامل

Flip distance between triangulations of a planar point set is APX-hard

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one edge and adding another one, such that the resulting graph is again a triangulation. Flips are a major way of locally transforming triangular meshes. We show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1102.1235  شماره 

صفحات  -

تاریخ انتشار 2011